An Algorithmic Game Theory Primer∗

Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and Constraint Logic, which provides a f...

An algorithmic game theory framework for bilateral bargaining with uncertainty

Bilateral bargaining is the most common economic transaction. Customarily, it is formulated as a non-cooperative game with uncertain-information and infinite actions (offers are real-value). Its automation is a long-standing open problem in artificial intelligence and no algorithmic methodology employable regardless of the kind of uncertainty is provided. In this paper, we provide the first ste...

A primer in game theory

Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory

‎Given the importance of Markov chains in information theory‎, ‎the definition of conditional probability for these random processes can also be defined in terms of mutual information‎. ‎In this paper‎, ‎the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...

Algorithmic game theory